On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
نویسندگان
چکیده
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e., the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of w 1 : : : w k for some nonnull words w1; : : : ; wk) is decidable, settling an open problem in [11, 12]. The proof is a rather involved reduction to the solution of a special class of Diophantine systems of degree 2 via a class of programs called two-phase programs. The result has applications to verification of infinite state systems.
منابع مشابه
On two-way nondeterministic finite automata with one reversal-bounded counter
We show that the emptiness problem for two-way nondeterministic finite automata augmented with one reversal-bounded counter (i.e., the counter alternates between nondecreasing and nonincreasing modes a fixed number of times) operating on bounded languages (i.e., subsets of for some nonnull words ) is decidable, resolving a problem left open in [4,7]. The proof is a rather involved reduction to ...
متن کاملVariations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: 1. The deterministic version has a decidable membership problem but has an undecidable emptiness problem. 2. The nondeterministic version has an undecidable membership problem and emptiness problem. There are many models of accepting devices for which ther...
متن کاملReachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversal-bounded counters (i.e. each counter can be incremented or decremented by 1 and tested for zero, but the number of times it can change mode from nondecreasing to nonincreasing and vice-ve...
متن کاملDeletion Operations on Deterministic Families of Automata
Many different deletion operations are investigated applied to languages accepted by one-way and twoway deterministic reversal-bounded multicounter machines, deterministic pushdown automata, and finite automata. Operations studied include the prefix, suffix, infix and outfix operations, as well as left and right quotient with languages from different families. It is often expected that language...
متن کاملThe University of Saskatchewan
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix, infix, su x and outfix relations. The insertion of regular languages and other languages into deterministic reversal-bounded multicounter languages is also studie...
متن کامل